Hierarchical Scheduling for State-based Services
نویسندگان
چکیده
Service descriptions based on type hierachies and abstract service states ruling the availability of operations permit more secure service combinations in distributed systems design than traditional signatures. The advantages of these additional information about services can also be utilized to make service scheduling more robust and efficient. A framework for scheduling such services is introduced and the central techniques used to provide a portable Java-based scheduling framework are discussed.
منابع مشابه
A Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)
Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...
متن کاملPlanware II:
Planware is an integrated development environment for the domain of complex planning and scheduling systems. Its design and implementation aim at supporting the entire planning and scheduling process including domain analysis and knowledge acquisition; application development and testing; and mixed-initiative, human-in-the-loop, plan and schedule computation. Based on principles of automatic so...
متن کاملA Scheduling Service Model and a Scheduling Architecture for an Integrated Services Packet Network
Integrated Services Packet Networks (ISPN) are designed to integrate the network service requirements of a wide variety of computer-based applications. Some of these services are delivered primarily through the packet scheduling algorithms used in the network switches. This paper addresses two questions related to these scheduling algorithms. The rst question is: what scheduling services should...
متن کاملAn integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملWorkflow Scheduling for Service Oriented Cloud Computing
Service Orientation (SO) and grid computing are two computing paradigms that when put together using Internet technologies promise to provide a scalable yet flexible computing platform for a diverse set of distributed computing applications. This practice gives rise to the notion of a computing cloud that addresses some previous limitations of interoperability, resource sharing and utilization ...
متن کامل